Problem:
 p(m,n,s(r)) -> p(m,r,n)
 p(m,s(n),0()) -> p(0(),n,m)
 p(m,0(),0()) -> m

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {3}
   transitions:
    p1(1,1,1) -> 3*
    p1(2,2,1) -> 3*
    p1(1,1,2) -> 3*
    p1(2,2,2) -> 3*
    p1(1,2,1) -> 3*
    p1(2,1,1) -> 3*
    p1(1,2,2) -> 3*
    p1(2,1,2) -> 3*
    01() -> 1*
    p0(1,1,1) -> 3*
    p0(2,2,1) -> 3*
    p0(1,1,2) -> 3*
    p0(2,2,2) -> 3*
    p0(1,2,1) -> 3*
    p0(2,1,1) -> 3*
    p0(1,2,2) -> 3*
    p0(2,1,2) -> 3*
    s0(2) -> 1*
    s0(1) -> 1*
    00() -> 2*
    1 -> 3*
    2 -> 3*
  problem:
   
  Qed